例句與造句

1. In the hp-FEM, the polynomial degrees can vary from element to element.
2. In practical applications the design of the mesh and the choice polynomial degrees are both important.
3. In addition, the estimation variances increase exponentially as polynomial degrees increase linearly ( i . e ., in unit steps ).
4. Analogously, splitting a hexahedron into eight subelements and varying their polynomial degrees by at most two yields 3 ^ 8 = 6, 561 refinement candidates.
5. where hat ( ^ ) denotes the estimate and ( " J "  " 1 ) is the polynomial degree, can be performed by applying the orthogonality principle.
6. It's difficult to find polynomial degree in a sentence. 用polynomial degree造句挺難的
7. Besides a p-refinement, the element can be subdivided in space ( as in h-adaptivity ), but there are many combinations for the polynomial degrees on the subelements.
8. Some FEM sites describe hp-adaptivity as a combination of h-adaptivity ( splitting elements in space while keeping their polynomial degree fixed ) and p-adaptivity ( only increasing their polynomial degree ).
9. Some FEM sites describe hp-adaptivity as a combination of h-adaptivity ( splitting elements in space while keeping their polynomial degree fixed ) and p-adaptivity ( only increasing their polynomial degree ).
10. Any low degree PIT problem can be reduced in subexponential time of the size of the circuit to a PIT problem of polynomial degree four; therefore, PIT of degrees four and under are intensely studied.
11. When, with Stirling's or Bessel's, the last term used includes the average of two differences, then one more point is being used than Newton's or other polynomial interpolations would use for the same polynomial degree.
12. For example, if a triangular or quadrilateral element is subdivided into four subelements where the polynomial degrees are allowed to vary by at most two, then this yields 3 ^ 4 = 81 refinement candidates ( not considering polynomially anisotropic candidates ).
13. The Bruun factorization, and thus the Bruun FFT algorithm, was generalized to handle arbitrary " even " composite lengths, i . e . dividing the polynomial degree by an arbitrary " radix " ( factor ), as follows.
14. In this case, " d " should be chosen as the smallest integer greater than the sum of the input polynomial degrees that is factorizable into small prime factors ( e . g . 2, 3, and 5, depending upon the FFT implementation ).
15. In particular, Riemann Hilbert factorization problems are used to extract asymptotics for the three problems above ( say, as time goes to infinity, or as the dispersion coefficient goes to zero, or as the polynomial degree goes to infinity, or as the size of the permutation goes to infinity ).
16. A proof that "'P "'= "'BPP "'would imply that either \ mathsf { NEXP } \ not \ subseteq \ mathsf { P / poly } or that permanent cannot be computed by nonuniform arithmetic circuits ( polynomials ) of polynomial size and polynomial degree.
更多例句：  下一頁